Exact Algorithms for MRE Inference
نویسندگان
چکیده
منابع مشابه
Exact Algorithms for MRE Inference
Most Relevant Explanation (MRE) is an inference task in Bayesian networks that finds the most relevant partial instantiation of target variables as an explanation for given evidence by maximizing the Generalized Bayes Factor (GBF). No exact algorithm has been developed for solving MRE previously. This paper fills the void and introduces Breadth-First Branch-and-Bound (BFBnB) MRE algorithms base...
متن کاملExact Statistical Inference for Some Parametric Nonhomogeneous Poisson Processes
Nonhomogeneous Poisson processes (NHPPs) are often used to model recurrent events, and there is thus a need to check model fit for such models. We study the problem of obtaining exact goodness-of-fit tests for certain parametric NHPPs, using a method based on Monte Carlo simulation conditional on sufficient statistics. A closely related way of obtaining exact confidence intervals in parametri...
متن کاملLimits of Exact Algorithms For Inference ofMinimum Size Finite State
We address the problem of selecting the minimum sized nite state machine consistent with given input/output samples. The problem can be solved by computing the minimum nite state machine equivalent to a nite state machine without loops obtained from the training set. We compare the performance of four algorithms for this task: two algorithms for incompletely speciied nite state machine reductio...
متن کاملExact sampling for Bayesian inference: towards general purpose algorithms
Propp and Wilson (1996) described a protocol, called coupling from the past, for exact sampling from a target distribution using a coupled Markov chain Monte Carlo algorithm. In this paper we discuss the implementation of coupling from the past for samplers on a continuous state space; our ultimate objective is Bayesian MCMC with guaranteed convergence. We make some progress towards this object...
متن کاملHeuristic and exact algorithms for Generalized Bin Covering Problem
In this paper, we study the Generalized Bin Covering problem. For this problem an exact algorithm is introduced which can nd optimal solution for small scale instances. To nd a solution near optimal for large scale instances, a heuristic algorithm has been proposed. By computational experiments, the eciency of the heuristic algorithm is assessed.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Artificial Intelligence Research
سال: 2016
ISSN: 1076-9757
DOI: 10.1613/jair.4867